Clustering based feature selection using Partitioning Around Medoids (PAM)
نویسندگان
چکیده
منابع مشابه
Image Compression Using Partitioning Around Medoids Clustering Algorithm
Clustering is a unsupervised learning technique. This paper presents a clustering based technique that may be applied to Image compression. The proposed technique clusters all the pixels into predetermined number of groups and produces a representative color for each group. Finally for each pixel only clusters number is stored during compression. This technique can be obtained in machine learni...
متن کاملK-medoids Clustering Using Partitioning around Medoids for Performing Face Recognition
Face recognition is one of the most unobtrusive biometric techniques that can be used for access control as well as surveillance purposes. Various methods for implementing face recognition have been proposed with varying degrees of performance in different scenarios. The most common issue with effective facial biometric systems is high susceptibility of variations in the face owing to different...
متن کاملUsing Modified Partitioning Around Medoids Clustering Technique in Mobile Network Planning
Optimization mobile radio network planning is a very complex task, as many aspects must be taken into account. Deciding upon the optimum placement for the base stations (BS’s) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper introduces the spatial clustering to solve the Mobile Networking Planning problem. It addresses antenna ...
متن کاملA New Partitioning Around Medoids Algorithm
Kaufman & Rousseeuw (1990) proposed a clustering algorithm Partitioning Around Medoids (PAM) which maps a distance matrix into a specified number of clusters. A particularly nice property is that PAM allows clustering with respect to any specified distance metric. In addition, the medoids are robust representations of the cluster centers, which is particularly important in the common context th...
متن کاملParallelising the k-Medoids Clustering Problem Using Space-Partitioning
The k-medoids problem is a combinatorial optimisation problem with multiples applications in Resource Allocation, Mobile Computing, Sensor Networks and Telecommunications. Real instances of this problem involve hundreds of thousands of points and thousands of medoids. Despite the proliferation of parallel architectures, this problem has been mostly tackled using sequential approaches. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Informatika
سال: 2020
ISSN: 2528-6374,1978-0524
DOI: 10.26555/jifo.v14i2.a17620